Memory Allocation

Distributed Memory Allocation Problem

This work attempts to study and offer a solution to an important resource allocation problem for explicitly parallel computing architectures. The problem of buffer space allocation in distributed on-chip memories is the key to lowering configuration (re-programming) overhead for systems such as SCORE [2] and enabling efficient virtualization of hardware resources essential for exploitation of s...

Balanced Allocation: Memory Performance Tradeoffs

Suppose we sequentially put n balls into n bins. If we put each ball into a random bin then the heaviest bin will contain ∼ logn/ log logn balls with high probability. However, Azar, Broder, Karlin and Upfal [SIAM J. Comput. 29 (1999) 180–200] showed that if each time we choose two bins at random and put the ball in the least loaded bin among the two, then the heaviest bin will contain only ∼ l...

Cache Replacement with Memory Allocation

Memory allocation method in stack

This paper explores the calling convention of popular compilers by analyzing the simple source codes of demonstration and provides simple and efficient solutions to iron issues out when SSEx instruction set is adopted in applications. It is very worth referring to its thought for migrating Unix/Linux applications to Microsoft Windows platform.

Pram Memory Allocation and Initialization

Two techniquesfor managing memory on a parallel randomaccess machine (PRAM) are presented. One is a scheme for an n/log n processor EREW PRAM that dynamically allocates and deallocates up to n records of the same size in O(log n) time. The other is a simulation of a PRAM with initialized memory by one with uninitialized memory. A CREW PRAM variant of the technique justifies the assumption that ...